<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Hard
  </div>
  <div>
   <h1 class="question_title">
    980. Find the Shortest Superstring
   </h1>
   <p>
    Given an array A of strings, find any&nbsp;smallest string that contains each string in
    <code>
     A
    </code>
    as a&nbsp;substring.
   </p>
   <p>
    We may assume that no string in
    <code>
     A
    </code>
    is substring of another string in
    <code>
     A
    </code>
    .
   </p>
   <div>
    &nbsp;
   </div>
   <div>
    <p>
     <strong>
      Example 1:
     </strong>
    </p>
    <pre>
<strong>Input: </strong><span id="example-input-1-1">["alex","loves","leetcode"]</span>
<strong>Output: </strong><span id="example-output-1">"alexlovesleetcode"</span>
<strong>Explanation: </strong>All permutations of "alex","loves","leetcode" would also be accepted.
</pre>
    <div>
     <p>
      <strong>
       Example 2:
      </strong>
     </p>
     <pre>
<strong>Input: </strong><span id="example-input-2-1">["catg","ctaagt","gcta","ttca","atgcatc"]</span>
<strong>Output: </strong><span id="example-output-2">"gctaagttcatgcatc"</span></pre>
     <p>
      &nbsp;
     </p>
    </div>
   </div>
   <p>
    <strong>
     Note:
    </strong>
   </p>
   <ol>
    <li>
     <code>
      1 &lt;= A.length &lt;= 12
     </code>
    </li>
    <li>
     <code>
      1 &lt;= A[i].length &lt;= 20
     </code>
    </li>
   </ol>
   <div>
    <div>
     &nbsp;
    </div>
   </div>
  </div>
  <div>
   <h1 class="question_title">
    980. 最短超级串
   </h1>
   <p>
    给定一个字符串数组
    <code>
     A
    </code>
    ，找到以&nbsp;
    <code>
     A
    </code>
    &nbsp;中每个字符串作为子字符串的最短字符串。
   </p>
   <p>
    我们可以假设
    <code>
     A
    </code>
    中没有字符串是
    <code>
     A
    </code>
    中另一个字符串的子字符串。
   </p>
   <p>
    &nbsp;
   </p>
   <p>
    <strong>
     示例 1：
    </strong>
   </p>
   <pre><strong>输入：</strong>["alex","loves","leetcode"]
<strong>输出：</strong>"alexlovesleetcode"
<strong>解释：</strong>"alex"，"loves"，"leetcode" 的所有排列都会被接受。</pre>
   <p>
    <strong>
     示例 2：
    </strong>
   </p>
   <pre><strong>输入：</strong>["catg","ctaagt","gcta","ttca","atgcatc"]
<strong>输出：</strong>"gctaagttcatgcatc"</pre>
   <p>
    &nbsp;
   </p>
   <p>
    <strong>
     提示：
    </strong>
   </p>
   <ol>
    <li>
     <code>
      1 &lt;= A.length &lt;= 12
     </code>
    </li>
    <li>
     <code>
      1 &lt;= A[i].length &lt;= 20
     </code>
    </li>
   </ol>
   <p>
    &nbsp;
   </p>
  </div>
 </body>
</html>